Adaptive Generalized Spatial Modulation Algorithm Based on Joint Optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Semi-automatic Video Object Extration Algorithm Based on Joint Transform and Spatial Domains Features

We propose a new adaptive algorithm for semiautomatic video object segmentation based on joint pixel features using the undecimated wavelet packet transform (UWPT) and luminance value. The method starts with the object’s boundary specification at the reference frame assisted by the user. After selecting a set of feature points which approximate the object’s boundary, the amplitude of coefficien...

متن کامل

A Novel Technique for Steganography Method Based on Improved Genetic Algorithm Optimization in Spatial Domain

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...

متن کامل

Adaptive Modulation TxPower Optimization

RF power output has been a major planning aspect for engineers since the start of radio transmission. Undoubtedly important, RF Power level is only one of many factors that determine a successful wireless network. To effectively evaluate and differentiate between various microwave systems and link performance, operators should be able to examine several key aspects of RF power output. Propagati...

متن کامل

An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt

An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Signal Processing, Image Processing and Pattern Recognition

سال: 2017

ISSN: 2005-4254,2005-4254

DOI: 10.14257/ijsip.2017.10.7.04